Combined Games with Randomly Delayed Beginnings
نویسندگان
چکیده
This paper presents two-person games involving optimal stopping. As far as we are aware, the type of problems study new. We confine our interest to such in discrete time. Two players chose, with randomised choice-priority, between two G1 and G2. Each game consists parts well-defined targets. part a sequence random variables which determines when decisive will begin. In each game, horizon is bounded, if not finished within horizon, lost by definition. Otherwise begins, on player entitled apply their or her strategy reach second target. If only one achieves targets, this winner. both win lose, outcome seen “deuce”. motivate context real-world problems. A few representative solved detail. The main objective article serve preliminary manual guide through possible approaches discuss under circumstances can obtain solutions, approximate solutions.
منابع مشابه
Evolution in games with randomly disturbed payoffs
We consider a simple model of stochastic evolution in population games. In our model, each agent occasionally receives opportunities to update his choice of strategy. When such an opportunity arises, the agent selects a strategy that is currently optimal, but only after his payoffs have been randomly perturbed. We prove that the resulting evolutionary process converges to approximate Nash equil...
متن کاملOn Dynamic Games with Randomly Arriving Players
We consider a dynamic game where additional players (assumed identical, even if there will be a mild departure from that hypothesis) join the game randomly according to a Bernoulli process. The problem solved here is that of computing their expected payoff as a function of time and the number of players present when they arrive, if the strategies are given. We consider both a finite horizon gam...
متن کاملHidden Markov model state estimation with randomly delayed observations
This paper considers state estimation for a discretetime hidden Markov model (HMM) when the observations are delayed by a random time. The delay process is itself modeled as a finite state Markov chain that allows an augmented state HMM to model the overall system. State estimation algorithms for the resulting HMM are then presented, and their performance is studied in simulations. The motivati...
متن کاملRandomly Evolving Tastes and Delayed Commitment
We consider a decision maker with randomly evolving tastes who faces dynamic decision situations that involve intertemporal tradeoffs, such as those in consumption savings problems. We axiomatize a recursive representation of choice that features uncertain consumption utilities, which evolve according to a subjective Markov process. The parameters of the representation, which are the subjective...
متن کاملEvolution and Learning in Games with Randomly Disturbed Payoffs
We consider four models of evolution and learning in games which rely on perturbations of payoffs, including stochastic fictitious play. In all cases, we establish global stability results for zerosum games, games with an interior ESS, potential games, and supermodular games.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9050534